Bounds on the Regularity and Projective Dimension of Ideals Associated to Graphs
نویسندگان
چکیده
In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of such ideals, generalizing other recent results. By Alexander duality, our results also apply to unmixed square-free monomial ideals of codimension two. We also discuss and connect these results to more classical topics in commutative algebra.
منابع مشابه
Projective parameterized linear codes
In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we find an upper bound for the minimum distance and, in some cases, we giv...
متن کاملProjective Parameterized Linear Codes Arising from some Matrices and their Main Parameters
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we will find an upper bound for the minimum distance and, i...
متن کاملIrena Peeva
S OF SOME OF MY PAPERS GROUPED BY TOPIC 1. Regularity. Let k be an algebraically closed field. We will work over a standard graded polynomial ring U over k. Projective dimension and regularity are the main numerical invariants that measure the complexity of a minimal free resolution. Let L be a homogeneous ideal in U , and let b ij (L) be its graded Betti numbers. The projective dimension pd(L)...
متن کاملRegularity, Depth and Arithmetic Rank of Bipartite Edge Ideals
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.
متن کامل